Explicit MPC: Hard constraint satisfaction under low precision arithmetic
نویسندگان
چکیده
منابع مشابه
Robust explicit MPC design under finite precision arithmetic
We propose a design methodology for explicit Model Predictive Control (MPC) that guarantees hard constraint satisfaction in the presence of finite precision arithmetic errors. The implementation of complex digital control techniques, like MPC, is becoming increasingly adopted in embedded systems, where reduced precision computation techniques are embraced to achieve fast execution and low power...
متن کاملConstraint Satisfaction Problems around Skolem Arithmetic
We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glaßer et al. [17] in the context of CSPs and settle the major open question from that paper, finding a certain satisfaction problem on circuits to be decidable. This we prove using the decidability of Skolem Arithmetic. We continue by studying first-order expans...
متن کاملModelling Exceptionally Hard Constraint Satisfaction Problems
Randomly-generated constraint satisfaction problems go through a phase transition as the constraint tightness varies. Loose constraints give an `easy-soluble' region, where problems have many solutions and are almost always easy to solve. However, in this region, systematic search algorithms may occasionally encounter problems which are extremely expensive to solve. It has been suggested that i...
متن کاملHard constraint satisfaction problems have hard gaps at location 1
An instance of Max CSP is a finite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satisfied constraints. Max CSP captures many well-known problems (such as Max k-SAT and Max Cut) and is consequently NP-hard. Thus, it is natural to study how restrictions on the allowed constraint types (or constraint languages) affe...
متن کاملCharacterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems - (Extended Abstract)
We explore the expressivity of constraint satisfaction problems (CSPs) in the arithmetic circuit model. While CSPs are known to yield VNP-complete polynomials in the general case, we show that for different restrictions of the structure of the CSPs we get characterizations of different arithmetic circuit classes. In particular we give the first natural non-circuit characterization of VP, the cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Control Engineering Practice
سال: 2016
ISSN: 0967-0661
DOI: 10.1016/j.conengprac.2015.12.005